Location:
Search - path plan
Search list
Description: 输入一个带权图的无向图，求出其中一个顶点到其它顶点最长的路径，并输出这条最长路径-input with a map without the right to plan, which sought a vertex to vertex other the longest path, and the output of the longest path.
Platform: |
Size: 8192 |
Author: 周子藤 |
Hits:
Description: 用C语言实现最短路径算法中的Bellman-Ford算法，这个算法可以用来解决信号处理中的一些问题。bellman_ford.c为源程序；distance.txt文件存放各界点之间的距离，以99999表示无穷大；bellman_ford.txt文件是输出文件，存放每轮循环得到的中间值，以及最后得到的到各个节点的最短距离，如果图包含负回路，文件中返回FALSE。-C language shortest path algorithm to achieve the Bellman-Ford algorithm, The algorithm can be used to solve signal processing some of the problems. Bellman_ford.c to source; distance.txt document repository all the distance between points, to 99,999 infinite said. bellman_ford.txt document output files, storage cycle round the middle value, and, finally, the various nodes of the shortest distance, if the plan contains negative loop, the paper returns FALSE.
Platform: |
Size: 103424 |
Author: 李文 |
Hits:
Description: 这个是用遗传算法实现的最优路径规划，经本人验证完全可以实现，能够出图。-This is a genetic algorithm is used to realize the optimum path planning, as I can verify that the realization of a plan to.
Platform: |
Size: 4096 |
Author: qushaohua |
Hits:
Description: matlab程序实现 最短路径问题 最短路径问题是图论研究中的一个经典算法问题， 旨在寻找图（由结点和路径组成的）中两结点之间的最短路径-matlab program to achieve the shortest path problem shortest path problem is the study of graph theory, a classical algorithm for the problem, aimed at finding a plan (by the node and path composed of) two nodes of the shortest path between
Platform: |
Size: 2048 |
Author: 孙子平 |
Hits:
Description: 马氏过程的应用很广， 机器人路径计划， 自动飞行器导航，多目标跟踪， 电梯计划， 网络交换和路由， 银行客户保有等等。-Application of Markov process is broad, robot path plan, automatic vehicle navigation, multi-target tracking, lift plans, network switching and routing, bank customers to maintain and so on.
Platform: |
Size: 9216 |
Author: bocai |
Hits:
Description: 这是一篇介绍BP神经网络在移动机器人路径规划方面的论文-Abstract：Improves the BP neural network algorithm，so the shortage of path —planning with the
．
BP neural
network algorithm is overcomed ．The simulation results indicate that on the bases of accessional momentum
method can eficiently improve this algorithm in convergence speed．At last，mobile robot dynamic path plan—
ning simulation is carried out in the environment with immobile and mobile obstacle．the simulation result indi—
cates that the method is feasible.
Platform: |
Size: 198656 |
Author: 王风 |
Hits:
Description: 实用GA算法进行，机器人运功规划，算法很经典，美国人写的-We present an ongoing research work on robot motion plan- ning using genetic algorithms. Our goal is to use this technique to build fast motion planners for robot with six or more degree of freedom. After a short review of the existing methods, we will introduce the genetic al- gorithms by showing how they can be used to solve the invers kinematic problem. In the second part of the paper, we show that the path planning problem can be expressed as an optimization problem and thus solved with a genetic algorithm. We illustrate the approach by building a path planner for a planar arm with two degree of freedom, then we demon- strate the validity of the method by planning paths for an holonomic mobile robot. Finally we describe an implementation of the selected ge- netic algorithm on a massively parallel machine and show that fast plan- ning response is made possible by using this appro
Platform: |
Size: 408576 |
Author: xiaofang |
Hits:
Description: matlab环境下建立威胁模型，规划路径，回避威胁-path plan
Platform: |
Size: 2048 |
Author: 亦心空 |
Hits:
Description: 自主虚拟人技术在虚拟空间中对人类的形态、运动、行为和认知方式进行模
拟，其目的是使虚拟人能够在没有外界干预的条件下，根据外在与内在的条件进
行自主的行为选择与控制。随着虚拟人角色越来越多地出现在虚拟训练、工业设
计、娱乐等各种应用中，人们对虚拟人的智能化和自主程度提出了更高的要求，
使得自主虚拟人成为了虚拟人研究中的热点问题之一。针对目前自主虚拟人控制
技术中存在的问题，本文对运动控制、感知、路径规划和行为控制等关键性技术
进行了研究。
-The technology of autonomous virtual human simulates the figure, motion,
behavior and cognitive style of human beings in virtual environment. The research
aim is to enable the characters to choose and control own behaviors according to the
internal and external conditions without user intervention. With more and more virtual
characters appearing in the applications of virtual training, industry designing and
entertainment, people bring up higher requirements to the intelligence and autonomy
of virtual human.Therefore, the autonomous virtual human has become a hotspot in
the research field of virtual human. To solving the problems in the control of
autonomous virtual human, this paper studied on some key technologies, such as
motion control, perception, path plan and behavior control.
Platform: |
Size: 1892352 |
Author: qiang |
Hits:
Description: 大学生职业规划优秀文章 详细介绍大学生如何规划未来道路 如何选择职业以及对成功的理解 -College career planning excellent article details how the students how to choose a career path plan for the future and understanding for success
Platform: |
Size: 2381824 |
Author: 刘亚 |
Hits:
Description: 用matlab仿真实现单机器人的路径规划，比较简单易懂，对初学者的一个很好的资料-single robot path plan,which is a good material for a learing person
Platform: |
Size: 5120 |
Author: 毛玲 |
Hits:
Description: 机器人重要的路径规划方法的文章，向量场直方图法，包括衍生出的vfh+、vfh*等。-the important path plan method
Platform: |
Size: 3072 |
Author: 徐恒 |
Hits:
Description: 这个是路径规划的，希望对需要的人有帮助。-This path planning, the hope for those who need help.
Platform: |
Size: 1024 |
Author: 恒少 |
Hits:
Description: ：为了保证无人作战飞机(UCAV)以最小的被发现概率和最优的航程到达目标点，在敌方防御区域内执
行任务前必须进行航路规划。蚁群优化(ACO)算法的并行实现机制适合于复杂作战环境下的UCAV航路规划，但是基本ACO算法有易陷于局部最优解的缺点-Abstract：To ensure unmanned combat aerial vehicle(UCAV)to reach the destination with an optimal path and a
minimum rate to be foun d，UCAV path plan ing must be ma de before mission execution．The parallelism of an t colony
optimization(ACO)is feasible in UCAV path planning under complicated combat environments
Platform: |
Size: 282624 |
Author: zhangyan |
Hits:
Description: 求解最优方案,以及次优方案，旨在为现实生活中的方案选择提供方便-Best plan choosing
Platform: |
Size: 1024 |
Author: 杨凌 |
Hits:
Description: • 实施一个工程计划时，若将整个工程分成若干个工序，有些工序可以同时实施，有些工序必须在完成另一些工序之后才能实施，工序之间的次序关系可用有向图表示。一个工程的完成时间可分为：最早完成时间和最晚完成时间。
• 关键路径的算法主要是通过计算工程的各个工序的缓冲时间（即：最晚完成时间减去最早完成时间的差），若某些工序的缓冲时间为零，这些工序即为关键路径，而缓冲时间不为零的工序就不是关键路径。
-• Implement a project plan, if the entire project is divided into several steps, some steps can be implemented simultaneously, some process must be completed before the implementation of some other process, process an order relation between the directed graph representation available. A project completion time can be divided into: earliest completion time and the latest finish time. • Critical path algorithm works mainly through the various steps of calculating buffer time (namely: the latest finish time minus the earliest completion time difference), if certain processes buffering time is zero, these processes is the critical path, and buffer time is not zero step is not critical path.
Platform: |
Size: 2048 |
Author: Bingo |
Hits:
Description: 马氏过程的应用很广， 机器人路径计划， 自动飞行器导航，多目标跟踪， 电梯计划， 网络交换和路由， 银行客户保有等等。-Application of Markov process is broad, robot path plan, automatic vehicle navigation, multi-target tracking, lift plans, network switching and routing, bank customers to maintain and so on.
Platform: |
Size: 9216 |
Author: 凝聚了 |
Hits:
Description: The path planning of mobile robot is an important issue in the field of robotics. Many algorithms have been designed to solve the path planning problem, including classical as well as intelligent approaches. The main aim of path planning is to construct collision free path a specified start position to the target position.-The path planning of mobile robot is an important issue in the field of robotics. Many algorithms have been designed to solve the path planning problem, including classical as well as intelligent approaches. The main aim of path planning is to construct collision free path a specified start position to the target position.
Platform: |
Size: 629760 |
Author: İ hsan |
Hits:
Description: 基于莱维飞行粒子群算法的点焊机器人路径规划-Spot welding robot Levy flight path planning based on particle swarm algorithm
Platform: |
Size: 26624 |
Author: 路婷 |
Hits:
Description: 使用python实现遗传算法实现机器人路径规划，有仿真实现路径。(Using Python to realize the genetic algorithm to realize the robot path planning, there is simulation to realize the path)
Platform: |
Size: 48128 |
Author: 大牛111 |
Hits: